Secondly , we propose a heuristic schedule algorithm based on deadline and survivability , taking the latest finish time of application assigned by users as a qos example 第二,以“用戶指定的其所能容忍的應(yīng)用程序完成的最晚時間”這種qos為例,給出了一種基于deadline和生存性的啟發(fā)式調(diào)度算法。
Firstly , we use the algorithm of the least cost scheduling in network plan . and a useful heuristic model described as the latest finish time model for resources scheduling is selected to solve the resource optimization , which based on investigation of heuristic methods of resource - constrained activity network 首先對網(wǎng)絡(luò)計劃進行工期? ?費用優(yōu)化,然后基于對多資源約束網(wǎng)絡(luò)計劃的啟發(fā)式方法分析的基礎(chǔ)上,選擇一種簡捷實用的啟發(fā)式方法? ?最遲完成時間( lft )判斷法,對網(wǎng)絡(luò)計劃進行多資源綜合協(xié)調(diào)。